Towards Concurrent Resource Managed Deduction towards Concurrent Resource Managed Deduction

نویسندگان

  • Mateja Jamnik
  • Manfred Kerber
  • Volker Sorge
چکیده

In this paper, we describe an architecture for resource guided concurrent mecha-nised deduction which is motivated by some ndings in cognitive science. Its beneets are illustrated by comparing it with traditional proof search techniques. In particular, we introduce the notion of focused search and show that a reasoning system can be built as the cooperative collection of concurrently acting specialised problem solvers. These reasoners typically perform well in a particular problem domain. The system architecture that we describe assesses the subgoals of a theorem and distributes them to the specialised solvers that look the most promising. Furthermore it allocates resources (above all computation time and memory) to the specialised reasoners. This technique is referred to as resource management. Each reasoner terminates its search for a solution of a given subgoal when the solution is found or when it runs out of its assigned resources. We argue that the eeect of resource management leads to a less brittle search technique which has some advantages over the traditional search techniques such as breadth rst or heuristic search. A prototype of the proposed system architecture is currently implemented in the mega/Mathweb framework.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classical linear natural deduction and the linear calculus: a preliminary report

In this report we develop the system NL of natural deduction for linear logic, and study the lambda calculus Lin arising in Curry-Howard correspondence to NL. The calculus realizes much more convincingly than previous approaches the promise of linear logic to the typing of concurrent processes, and enjoys the confluence and subject reduction properties. We further consider the relation of the s...

متن کامل

Resource Guided Concurrent Deduction

Our poster proposes an architecture for resource guided concurrent mechanised deduction which is motivated by some findings in cognitive science. Our architecture particularly reflects Hadamard’s “Psychology of Invention” [Hadamard44]. In his study Hadamard describes the predominant role of the unconsciousness when humans try to solve hard mathematical problems. He explains this phenomenon by i...

متن کامل

De nitional Concurrent Constraint Programming

In this paper, deenitional constraint constraint programming, abbreviated as CDC, is presented as a uniform framework for declarative concurrent programming. The new paradigm supports a uniform concurrent computational model unifying functional evaluation, linear deduction and constraint solving. It leads us from a constraint based integration of functional and logic programming to a powerful f...

متن کامل

Cycle Time Reduction and Runtime Rebalancing by Reallocating Dependent Tasks

Business Process Management Systems (BPMS) is a complex information system that provides designing, administrating, and improving the business processes. Task allocation to human resources is one of the most important issues which should be managed more efficiently in BPMS. Task allocation algorithms are defined in order to meet the various policies of organizations. The most important of these...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999